Transient solution to the time-dependent multiserver Poisson queue
نویسندگان
چکیده
منابع مشابه
Transient Solution to the Time-dependent Multiserver Poisson Queue
We derive an integral equation for the transient probabilities and expected number in the queue for the multiserver queue with Poisson arrivals, exponential service for timevarying arrival and departure rates, and a time-varying number of servers. The method is a straightforward application of generating functions. We can express pĉ−1(t), the probability that ĉ − 1 customers are in the queue or...
متن کاملTransient Solution of an M/M/1 Variant Working Vacation Queue with Balking
This paper presents the transient solution of a variant working vacation queue with balking. Customers arrive according to a Poisson process and decide to join the queue with probability $b$ or balk with $bar{b} = 1-b$. As soon as the system becomes empty, the server takes working vacation. The service times during regular busy period and working vacation period, and vacation times are assumed ...
متن کاملNopassing Multiserver Queue with Additional Heterogeneous Servers and Inter-dependent Rates
In many congestion problems, the customers may not like to join a long queue and may balk. To reduce the balking behavior of the customers, the provision of additional servers can be made in such situations. In the present paper, we investigate a Markovian queueing model with balking, interdependent rates and additional servers under no passing constraint. Due to nopassing restriction, the cust...
متن کاملA Finite-Source Multiserver Queue with Preemptive Priorities
We consider systems with finite sources of requests, multiple servers, and an arbitrary number of preemptive priority classes. The service times and the source idle times are assumed to be exponentially distributed. We present an efficient approach based on marginal state description. The approach allows a recurrent analysis of priority levels where the usage of servers by higher priority reque...
متن کاملOn a Multiserver Finite Buffer Queue with Impatient
In this paper we study a multiserver finite buffer queue in which customers have an stochastic deadline of phase-type until the beginning of their service. The following service disciplines are considered: FCFS (First-Come First-Served), LCFS (Last-Come First-Served) and SIRO (Service In Random Order) along with a parameterizable probabilistic push-out mechanism. Although this model has many ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2005
ISSN: 0021-9002,1475-6072
DOI: 10.1239/jap/1127322026